Signature related invariants of manifolds—I. monodromy and γ-invariants

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SIGNATURE RELATED INVARIANTS OF MANIFOLDS-I. MONODROMY AND y-INVARIANTS

IF x2”-I IS A smooth closed oriented manifold and a: n,(X)-+ U(I) is a unitary representation, then Atiyah, Singer, and Patodi[Z] defined an invariant 7(X, a) via the theory of spectral asymmetry (these denoted p,(X); but their sign conventions differ from ours, see Section 1). In fact y(X, a) measures the alteration or “defect” of the n-invariant of a Riemannian manifold X when “twisted” by su...

متن کامل

λ-Projectively Related Finsler Metrics and Finslerian Projective Invariants

In this paper, by using the concept of spherically symmetric metric, we defne the notion of λ-projectively related metrics as an extension of projectively related metrics. We construct some non-trivial examples of λ-projectively related metrics. Let F and G be two λ-projectively related metrics on a manifold M. We find the relation between the geodesics of F and G and prove that any geodesic of...

متن کامل

FULL SIGNATURE INVARIANTS FOR L0(F (t))

Let F/Q be a number field closed under complex conjugation. Denote by L0(F (t)) the Witt group of hermitian forms over F (t). We find full invariants for detecting non–zero elements in L0(F (t))⊗Q, this group plays an important role in topology in the work done by Casson and Gordon. 1. L-groups and signatures Let R be a ring with (possibly trivial) involution. An –hermitian ( = ±1) form is a se...

متن کامل

Distance-related Invariants on Polygraphs

LetM n be a graph which is obtained from a path Pn or a cycle Cn by replacing each vertex by a xed graph M and replacing each edge by a xed set of edges joining the corresponding copies of M A matrix approach to the computation of distance related invariants in such graphs is presented This approach gives a general procedure to obtain closed formulas depending on n for such invariants of M n As...

متن کامل

Hypertree width and related hypergraph invariants

Tree-width of graphs is a well studied notion, which plays an important role in structural graph theory and has many algorithmic applications. Various other graph invariants are known to be the same or within a constant factor of tree-width, for example, the bramble number or tangle number of a graph [4, 5], the branch-width [5], the linkedness [4], and the number of cops required to win the ro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology

سال: 1979

ISSN: 0040-9383

DOI: 10.1016/0040-9383(79)90033-8